Information-theoretical optimization techniques
نویسنده
چکیده
Let (I, denotes the expectation of q> w.r.t. /.i. For a set function (p on «/, <„ denotes expectation of (p w.r.t. H | n, i.e. (K = Z(A)n(A).
منابع مشابه
Optimization of two-stage production/inventory systems under order base stock policy with advance demand information
It is important to share demand information among the members in supply chains. In recent years, production and inventory systems with advance demand information (ADI) have been discussed, where advance demand information means the information of demand which the decision maker obtains before the corresponding actual demand arrives. Appropriate production and inventory control using demand info...
متن کاملResearch of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information
Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...
متن کاملResearch of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information
Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...
متن کاملInformation Theoretical Clustering via Semidefinite Programming
We propose techniques of convex optimization for information theoretical clustering. The clustering objective is to maximize the mutual information between data points and cluster assignments. We formulate this problem first as an instance of max k cut on weighted graphs. We then apply the technique of semidefinite programming (SDP) relaxation to obtain a convex SDP problem. We show how the sol...
متن کاملGame Theoretical Optimization Techniques inspired by Information Theory
Inspired by previous work on information theoretical optimization problems, the basics of an axiomatic theory of certain special twoperson zero-sum games is developed. Among the two players, one – “Observer” – is imagined to have a “mind” , the other – “Nature” – not. Expressing such ideas leads to un-symmetric modeling as the two players are treated quite differently. We demonstrate that the t...
متن کاملUsing Entropy-Based Methods to Study General Constrained Parameter Optimization Problems
In this letter we propose the use of physics techniques for entropy determination on constrained parameter optimization problems. The main feature of such techniques, the construction of an unbiased walk on energy space, suggests their use on the quest for optimal solutions of an optimization problem. Moreover, the entropy, and its associated density of states, give us information concerning th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Kybernetika
دوره 15 شماره
صفحات -
تاریخ انتشار 1979